A tight upper bound for the path length of AVL trees
نویسندگان
چکیده
منابع مشابه
Tight Upper and Lower Bounds on the Path Length of Binary Trees
The external path length of a tree T is the sum of the lengths of the paths from the root to each external node. The maximal path length diierence, , is the diierence between the length of the longest and shortest such path. We prove tight lower and upper bounds on the external path length of binary trees with N external nodes and prescribed maximal path length diierence. In particular, we give...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملA Tight Amortized Bound for Path Reversal
Let T be a rooted tree. A path reversal at a node x in T is performed by traversing the path from x to the tree root r and making x the parent of each node on the path other than X. Thus x becomes the new tree root. (See Fig. 1). The cost of the reversal is the number of edges on the path reversed. Path reversal is a variant of the standard path compression algorithm for maintaining disjoint se...
متن کاملAVL Trees
Two formalizations of AVL trees with room for extensions. The first formalization is monolithic and shorter, the second one in two stages, longer and a bit simpler. The final implementation is the same. If you are interested in developing this further, please contact .
متن کاملA Best Possible Bound for the Weighted Path Length of Binary Search Trees
The weighted path length of optimum binary search trees is bounded above by Y'./3i + 2 a. + H where H is the entropy of the frequency distribution, /3i is the total weight of the internal nodes, and aj is the total weight of the leaves. This bound is best possible. A linear time algorithm for constructing nearly optimal trees is described. One of the popular methods for retrieving information b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90037-i